Password protected device using incorrect passwords as seed values for pseudo-random number generator for outputting random data to thwart unauthorized accesses

ABSTRACT

An electronic key which includes a pseudo-random number generator. If the correct password is received, the contents of a secure memory will be outputted by the electronic key. However, if an incorrect password is received, that password will be used as a seed value for the pseudo-random number generator, and the resulting value will be outputted. 
     Thus, if a copier exercises the key through all possible passwords, the incorrect passwords, as well as the correct password, will result in the same output data every time it is tried.

CROSS-REFERENCE TO OTHER APPLICATIONS

The present application is a continuation-in-part application, claiming priority from the following commonly-owned U.S. applications, all filed on May 15, 1989, and all hereby incorporated by reference: Ser. No. 352,581, "one-Wire Bus Architecture" pending; Ser. No. 351,759, "Compact Electronic Module" now U.S. Pat. No. 4,982,371; Ser. No. 351,760, "Compact Package for Electronic Module" now U.S. Pat. No. 5,091,771; Ser. No. 351,998, "Low-voltage Low-power Static RAM" now U.S. Pat. No. 4,972,377; Ser. No. 352,598, "Hand-held Wand for Reading Electronic Tokens" now U.S. Pat. No. 4,945,217; Ser. No. 352,596, "Interface for Receiving Electronic Tokens" now U.S. Pat. No. 4,948,954; Ser. No. 351,999, "Serial Port Interface to Low-voltage Low-power Data Module" now U.S. Pat. No. 5,045,675; Ser. No. 352,142, "RAM/ROM Hybrid Memory Architecture" now U.S. Pat. No. 4,995,004; and Ser. No. 351,997, "Modular Data System" now abandoned U.S. patent application.

PARTIAL WAIVER OF COPYRIGHT

All of the material in this patent application is subject to copyright protection under the copyright laws of the United States and of other countries. As of the first effective filing date of the present application, this material is protected as unpublished material.

Portions of the material in the specification and drawings of this patent application are also subject to protection under the maskwork registration laws of the United States and of other countries.

However, permission to copy this material is hereby granted to the extent that the owner of the copyright and maskwork rights has no objection to the facsimile reproduction by anyone of the patent document or patent disclosure, as it appears in the United States Patent and Trademark Office patent file or records, but otherwise reserves all copyright and maskwork rights whatsoever.

The present application also claims priority from PCT application PCT/US90/02891, filed May 15, 1990; which is hereby incorporated by reference.

It is also noted that the following applications, of common assignee and common effective filing date with the present application, contain at least some drawings in common with the present application:

Ser. No. 615,615, filed Nov. 19, 1990, entitled "Low-Power Memory with Block Moves Implemented by Pointer Update";

Ser. No. 615,608, filed Nov. 19, 1990, entitled "Electronic Key with Multiple Subkeys Writable Via Scratchpad";

Ser. No. 615,618, filed Nov. 19, 1990, entitled "Low-Power Integrated Circuit with Selectable Battery Modes"; all of which are hereby incorporated by reference.

BACKGROUND OF THE INVENTION

The present invention relates to electronic keys, and to integrated circuits having secure memory therein.

ELECTRONIC KEYS

An electronic key is a circuit which performs the function of a key, using stored information instead of shaped metal. In order to fulfill this function, an electronic key should preferably provide two kinds of concealment: the data in the key's secure memory should be concealed, and the password which permits access to the key's secure memory should also be concealed.

Electronic keys are used primarily to provide access to secure electronic data upon receipt of a valid password and to prohibit such access if an invalid password is received. One such application is the use of an electronic key hardware module in conjunction with commercially available software. The electronic key module is attached to the computer operating the software in a manner to allow the software to access the electronic key, and the software is programmed with an algorithm to verify that the module is attached to the computer. Thus, while the software is easily copied, the electronic key hardware module is not; and the software cannot, therefore, be simultaneously used in several computers.

It may happen that a would-be counterfeiter can easily gain access to a sample legitimate key. If a copier could simply read the stored code in a key, the copier could easily make counterfeit keys to reproduce this code. Therefore, keys are commonly password-protected: the key will not give out its secure data until it receives the proper password.

If the counterfeiter can simply run all possible passwords into the chip inputs, eventually he will hit upon the correct one. To some extent, this tactic can be countered simply by using a sufficiently long password.¹

However, for many applications this is still insufficiently secure: in some cases, a counterfeiter may be able to connect a digital monitoring circuit in parallel with the electronic key port, so that he can listen in on a transaction between a legitimate key and the legitimate software which is talking to that key. To reduce the vulnerability to this type of assault, software is often designed to perform multiple accesses to the key, and to present the key with a number of false passwords as well as the real password. The key contains a random number generator, which generates garbage data, in the same format as the real data in the secure memory, when a false password is received. (See U.S. Pat. Nos. 4,810,975 and 4,855,690, which are both hereby incorporated by reference.) Thus, a would-be counterfeiter will see a number of passwords being issued (including the correct one), and will see a variety of data fields being returned (including the correct one). In many cases a counterfeiter cannot easily tell which data is the correct data, so there is still some weakness here.

However, such systems still have a weakness: if a true random number generator is used, and if a false password is submitted twice, the data returned will be different each time. Thus, a counterfeiter can identify the correct password by submitting each password twice.

An electronic key may have to withstand harsh environments (such as users' pockets), and is therefore packaged to provide a high degree of physical robustness. Similarly, it is desirable to maximize the immunity of electronic keys to electrostatic discharge.² Electronic keys, and related circuits, have found use in a wide variety of applications.

However, electronic keys present some unusual difficulties in design. There is always some risk that an intruder may obtain a key and attempt to "crack"it, to gain free access to the system which is supposed to be protected. Thus, although perfect security may not be possible, the design must provide as much security as is economically possible.

SUMMARY OF THE INVENTION

The present application sets forth several novel points. Some novel teachings will now be summarized, but this does not imply that other novel teachings are not present.

Electronic Key with Repeatable False Data

The present invention provides an electronic key which includes a deterministic pseudo-random number generator. If the correct password is received, the contents of a secure memory will be outputted by the electronic key. However, if an incorrect password is received, that password will be used as a seed value for the pseudo-random number generator, and the resulting value will be outputted. Since the pseudo-random number generator is deterministic, each false password will always result in the same data output.

If a copier exercises the key through all possible passwords, the incorrect passwords, as well as the correct password, will result in the same output data every time it is tried. If a truly random output resulted from a false password, the output would be different every time it was enabled, even if the same false password was submitted twice. In this deterministic arrangement, however, the "random" data is "seeded" by the password sent in by the user. As such, if a given invalid password is written to the part twice, the "random" data output by the part will be the same each time. In fact, every possible 64-bit password combination has a unique "random" data sequence associated with it. Thus, the fact that the "random" data is deterministic adds to the security of the part.

BRIEF DESCRIPTION OF THE DRAWING

The present invention will be described with reference to the accompanying drawings, which show important sample embodiments off the invention and which are incorporated in the specification hereof by reference, wherein:

FIG. 1 schematically shows the writing of a command word to the electronic key chip of the presently preferred embodiment.

FIG. 2 shows the field organization of the 24-bit command word, in the presently preferred embodiment.

FIG. 3 illustrates the subkey codes used in the presently preferred embodiment.

FIG. 4 shows the data organization of the multiple subkeys of the electronic key chip of the presently preferred embodiment.

FIG. 5 shows the sequence of operations when a Set Password command is received, in the electronic key chip of the presently preferred embodiment.

FIG. 6 shows the sequence of operations when a Set Secure Data command is received, in the electronic key chip of the presently preferred embodiment.

FIG. 7 shows the sequence of operations when a Get Secure Data command is received, in the electronic key chip of the presently preferred embodiment.

FIG. 8 shows the sequence of operations when a Set Scratchpad Data command is received, in the electronic key chip of the presently preferred embodiment.

FIG. 9 shows the sequence of operations when a Get Scratchpad Data command is received, in the electronic key chip of the presently preferred embodiment.

FIG. 10 shows the address map for block selection;

FIG. 11 shows block selector codes;

FIG. 12 is a flow diagram for the move block operation;

FIG. 13 shows the timing of a Write One time slot on the one-wire bus, in the presently preferred embodiment.

FIG. 14 shows the timing of a Write Zero time slot on the one-wire bus, in the presently preferred embodiment.

FIG. 15 shows the timing of a Read time slot on the one-wire bus, in the presently preferred embodiment.

FIG. 16 shows the timing of reset pulse operations, on the one-wire bus, in the presently preferred embodiment.

FIG. 17 shows the timing of the presence-detect operations (in relation to the reset), on the one-wire bus, in the presently preferred embodiment.

FIGS. 18 and 19 show the timing of data transfers on the three-wire bus, in the presently preferred embodiment.

FIG. 20 shows the overall layout of the chip of the presently preferred embodiment.

FIG. 21 shows the preferred package of the chip of the presently preferred embodiment.

FIGS. 22A-1, 22A-2, 22B-1, 22B-2, 22C-1, 22C-2, 22C-3, 22D-1, 22D-2 show circuitry which is essentially the same as that used, in the presently preferred embodiment, for decoding command words and also for pseudo-random number generation.

FIGS. 23A, 23B, 23C show the circuitry used, in the presently preferred embodiment, for holding block pointer assignments and for checking that the block pointers are mutually consistent.

FIG. 24 shows the circuitry used for selection of the power supply input, in the presently preferred embodiment.

FIGS. 25A and 25B are two parts of a single Figure which shows the one-wire-to-three-wire conversion circuit used, in the presently preferred embodiment, in the integrated circuit of FIG. 20.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

The numerous innovative teachings of the present application will be described with particular reference to the presently preferred embodiment. However, it should be understood that this class of embodiments provides only a few examples of the many advantageous uses of the innovative teachings herein. In general, statements made in the specification of the present application do not necessarily delimit any of the various claimed inventions. Moreover, some statements may apply to some inventive features but not to others.

Overall Description of the Sample Embodiment

The DS1205 MultiKey is an enhanced version of the DS1204U Electronic Key which has both a standard 3-wire interface, data, clock, and reset, and a 1-wire "touch" interface. The DS1205 MultiKey has three secure read/write subkeys which are each 384 bits in length. In addition, there is a 512-bit read/write scratchpad which can be used as a non-secure data area or as a holding register for data transfer to one of the three subkeys. Each subkey within the part is uniquely addressable.

Operation

The writing of a command word to the DS1205 MultiKey specifies the operation to be performed and the subkey to be operated on. There are two classes of operations available for the DS1205 MultiKey. These are operations which access one of the three secure read/write subkeys and operations which access the read/write scratchpad (FIG. 1).

Command Word

The 24-bit command word is grouped into three fields of eight bits each. These byte-sized fields specify the subkey which is to be accessed, the starting byte address for the data transfer operation, and the type of command to be performed. The starting byte address and the subkey identifier fields are required to be given in both true and complement form. If these values do not match, the access to the part will be terminated (FIG. 2).

The first byte of the command word is made up of the complement of the 2-bit subkey code, identifying which subkey is being accessed, and the complement of the 6-bit address field, which specifies the starting byte address of the given subkey to be accessed. The second byte of the command word consists of the 2-bit subkey code and the 6-bit starting byte address. The third byte of the command word is the 8-bit function code which defines which of the six commands is to be executed. Each command is subkey- and address-specific and, as such, each command precludes the use of certain subkey codes and starting address locations. FIG. 3 illustrates the subkey codes, starting address locations, and function codes that are valid for each of the six command operations.

Secure Subkey Commands

Each secure subkey within the DS1205 MultiKey is comprised of a 64-bit ID field, a 64-bit password field, and a 384-bit secured data field (FIG. 4). The three commands which operate on the secure subkeys are as follows:

1) Set password

2) Set secure data

3) Get secure data

Set Password

The Set Password command is used to enter data into the I.D. field and the password field of the selected subkey. Upon recognition of the correct I.D., the DS1205 MultiKey will erase the entire contents of the selected subkey and proceed to rewrite the 64-bit I.D. field and the 64-bit password field. The flow sequence is shown in FIG. 5.

Set Secure Data

The Set Secure Data command is used to enter data into the selected subkey. The first 64 bits of the data stream will be a read of the I.D. field from the selected subkey. The next 64 bits of the data stream must contain the password for the selected subkey. If the received password does not match the password field for the selected subkey, the DS1205 MultiKey will terminate the transaction immediately. The flow sequence is shown in FIG. 6.

Get Secure Data

The Get Secure Data command is used to retrieve secured data from the selected subkey. The 64-bit I.D. field of the selected subkey must be read by the host. The password for the selected subkey must then be transmitted to the DS1205 MultiKey immediately after the command word. If the received password fails to match the password field for the selected subkey, the DS1205 MultiKey will output randomly generated data instead of the secured data. The flow sequence is shown in FIG. 7.

Scratchpad Read/Write Commands

The 512-bit Read/Write Scratchpad of the DS1205 MultiKey is not password-protected and is accessible beginning at any byte boundary. The scratchpad can be used to store unsecured data or it can be used to build up a data structure which can be verified and then transferred to a secure subkey. The three commands which operate on the read/write scratchpad are as follows:

1) Set scratchpad data

2) Get scratchpad data

3) Move block

Set Scratchpad Data

The Set Scratchpad Data command is used to enter data into the DS1205 MultiKey scratchpad. The command word must specify the starting byte address for the data transfer. Valid byte addresses are 0 through 63. The DS1205 MultiKey will write data to the scratchpad until byte 63 has been written or until the RST line goes to a logic low level. The flow sequence is shown in FIG. 8.

Get Scratchpad Data

The Get Scratchpad data command is used to retrieve data from the 512-bit scratchpad. The command word must specify the starting byte address for the data retrieval. Valid byte addresses are 0 through 63. The DS1205 MultiKey will retrieve data from the scratchpad until byte 63 has been read or the RST line goes to a logic low level. The flow sequence is shown in FIG. 9.

Move Block

The Move Block command is used to transfer data, which has been previously entered into the scratchpad and verified, to one of the three secure subkeys. Data can be transferred as one large block of 512 bits or it can be transferred in blocks of 64 bits each (FIG. 10). There are nine valid block selectors which are used to specify which block or blocks are to be transferred (FIG. 11). As a further precaution against accidental erasure of a secure subkey, the 64-bit password of the destination subkey must be entered and match the destination subkey. If the passwords fail to match, the operation is terminated. The flow sequence is shown in FIG. 12.

1-Wire Interface

When The "touch" interface is used, all communications to and from the DS1205 MultiKey are accomplished via a single interface lead. Data is read and written through the use of time slots to manipulate bits and a command word to specify the transaction.

Write Time Slots

A write time slot is initiated when the host pulls the data line from a high logic level to a low logic level. There are two types of write time slots: Write One time slots and Write Zero time slots. All write time slots must be a minimum of 60uS and a maximum of 120uS in duration. There is a minimum of a 1uS valid access recovery time between time slots.

For the host to generate a Write One time slot, the data line must be pulled to a logic low level and then released, allowing the data line to pull up to a high level within 15uS after the start of the write time slot (see FIG. 13).

For the host to generate a Write Zero time slot, the data line must be pulled to a logic low level and remain low for the duration of the write time slot (see FIG. 14).

Read Time Slots

The host generates read time slots when data is to be read from the 1-wire interface. A read time slot is initiated when the host pulls the data line from a logic high level to a logic low level. The data line must remain at a low logic level for a minimum of 1uS and a maximum of 15uS. This maximum time of 15uS includes the time required for the data line to pull up to a high level after it is released. The state of the 1-wire data line must be read by the host within 15uS after the start of the read time slot. After this time, the state of the data is not guaranteed (see FIG. 15). All read time slots must be a minimum of 60uS in duration with a minimum of a 1uS valid access recovery time between individual read time slots.

1-Wire Protocol

The 1-wire protocol can be viewed as having three distinct layers. These layers are the Presence Detect layer, the Reset layer, and the Command layer.

Presence Detect

The presence detect layer is used to signal to a host device that a new device has been attached to the 1-wire port. The 1-wire port from the host remains at a logic high level during quiescent times between read and write time slots. This high time must be present for a minimum of 15uS before the new device can assert a presence detect signal. The presence detect signal will be a logic low level asserted by the newly attached device which remains low for a maximum of 240uS and is then released (see FIG. 16). This low logic level can be detected by the host and used as an interrupt condition for the host processor.

Device Reset

The Reset layer is used to reset the attached 1-wire devices. This allows the host to place the 1-wire device or devices into a known state at any time. The reset signal consists of a logic low level asserted by the host for a minimum of 480uS. After this, the host must release the 1-wire signal line and allow it to rise to a logic high level. This high logic level must be maintained by the host for a minimum of 480uS before any data can be exchanged. During this logic high time, any device present on the 1-wire signal line will assert its presence- detect waveform.

1- Wire Commands

There are four commands which can be issued by the host on the 1-wire port. These are:

1) [33 hex] read ROM data

2) [55 hex] match ROM data

3) [FO hex] search ROM data

4) [CC hex] pass-through mode

Read ROM Data

Upon recognition of the command word [33 hex], the DS1205 is ready to respond to the next eight read time slots with the Type Identifier number. This number is a hexadecimal 02 and is unique to the DS1205 part. After receipt by the host of the Type Identifier number, the DS1205 is ready to output the unique 48-bit serial number contained within the device. The host must issue 48 read time slots to retrieve this number. Following the 48 -bit serial number is an eighth-bit Cyclic Redundancy Check (CRC) value. This CRC value has been calculated over the Type Identifier and Serial Number, 56 bits total, using the following polynomial:

    p(x)=x.sup.2 +x.sup.3 assuming x0=>LSB

This calculated value is then lasered into the part at the time of manufacture. To read the CRC value, the host must issue eight additional read time slots.

Match ROM Data

The Match ROM data command is used as a device select when multiple 1-wire devices are connected to a single bus. This command allows the host to address any one of the multiple 1-wire devices on an individual basis. To do a Match ROM data command, the host must issue the command [55 hex] to the device with eight write time slots. Following the command byte, the host must write the desired device's Type Identifier, serial number, and CRC byte. If all of these values match the data stored internally in the ROM, the DS1205 can now be accessed using the standard DS1205 commands and protocol. If any of the bit values transmitted by the host fail to match the ROM data pattern, the access will be terminated. To return from a pattern fail condition, the host must issue a Reset command: ##STR1##

Search ROM Data

The Search ROM data command allows the host 1-wire device to poll efficiently to determine the unique ROM address of all devices on the 1-wire bus. In this mode, each of the bits of the ROM data requires three time slots on the 1-wire bus. The first two time slots are read time slots in which the DS1205 transmits back to the host the value of the ROM bit followed by its complement. The third time slot is a write time slot in which the host supplies its desired value for the ROM bit. The DS1205 then compares the desired value with the actual ROM bit. If they disagree, the DS1205 will go to a high impedance state until a RESET is issued by the host. If the bits agree, the DS1205 increments its internal counter to point to the next bit in the ROM data and then repeats the same set of three time slots for the next bit. If all bits of the ROM are matched correctly, the host may access the DS1205 with the standard command structure for the part.

Example of a ROM Search

The following example of the ROM search process assumes two different DS1205s are connected to the same 1-wire bus. The ROM data of the two DS1205s begins as shown: ##STR2##

The search process is as follows:

1) The host begins by resetting all devices present on the 1-wire bus.

2) The host will then issue the Search ROM Data command on the 1-wire bus.

3) The host executes two read time slots and receives a zero bit followed by a one bit. This indicates that all devices still coupled have zero as their first ROM bit.

4) The host executes a write zero time slot as the third slot in the set of three. This action keeps ROM2 and ROM1 coupled.

5) The host executes two read time slots and receives a zero bit followed by a one bit. This indicates that all devices still coupled (ROM2 and ROM1) have a zero as their second ROM bit.

6) The host will executes a write zero time slot as the third time slot to keep ROM2 and ROM1 coupled.

7) The host executes two read time slots and receives two zero bits. This indicates that both one bits and zero bits exist as the third bit of the ROM I.D.'s of the devices coupled.

8) The host executes a write zero time slot as the third bit. This decouples ROM2, leaving only ROM1 still coupled.

9) The host reads the remainder of the ROM bits for ROM1 using three time slots for each bit. After this, the host can communicate to the underlying logic, if desired. This completes the first ROM I.D. search pass, in which one of the devices was found.

10) The host starts a new ROM search sequence by repeating steps 1 through 7 above.

11) The host supplies a write one time slot as the third bit. This decouples ROM1, leaving only ROM2 still connected.

12) The host reads the remainder of the ROM I.D. bits for ROM2 and communicates with the underlying logic, if desired.

If more devices are present on the 1-wire, the same structure as presented above will be used to determine the uniqure ROM I.D. of each attached device. As soon as multiple devices are detected, a series of writes will be used to disable that branch in the search path.

Note the following:

The host learns the unique address (ROM data pattern) of one 1-wire device on each ROM SEARCH operation. The time required to derive the part's unique address is:

    960uS+[8+3×61uS]×61uS=13.16mS

The host is therefore capable of identifying 75 different 1-wire devices per second.

Additionally, the data obtained from the two read time slots of each set of three time slots have the following interpretations:

00--There are still devices attached which have conflicting bits in this position.

01--All devices still coupled have a zero bit in this bit position.

10--All devices still coupled have a one bit in this bit position.

11--There are no devices attached to the 1-wire bus. (This is an error condition.

Pass-Thru Mode

The Pass-Thru command is used to allow a host connected to the 1-wire bus to gain access to the DS1205 directly. It can be used only when there is one DS1205 on the 1-wire bus. This command bypasses the serial number internal to the DS1205 and allows the host to directly control the DS1205 with the DS1205 commands and protocol.

3-Wire Bus

The 3-wire bus is comprised of three signals. These are the RST (reset) signal, the CLK (clock) signal, and the DQ (data) signal. All data transfers are initiated by driving the RST input high. The RST signal provides a method of terminating a data transfer.

A clock cycle is a sequence of a falling edge followed by a rising edge. For data inputs, the data must be valid during the rising edge of a clock cycle. Command bits and data bits are input on the rising edge of the clock and data bits are output on the falling edge of the clock. All data transfers terminate if the RST is low and the DQ pin goes to a high impedance state. When data transfers to the DS1205 are terminated by the RST signal going low, the transition of the RST going low must occur during a high level of the CLK signal. Failure to ensure that the CLK signal is high will result in the corruption of the last bit transferred. Data transfers are illustrated in FIGS. 18 and 19 for normal modes of operation.

1-Wire/3-Wire Arbitration

The DS1205 can utilize both the 1-wire and the 3-wire busses simultaneously. Neither input bus has priority over the other. Instead, if both inputs are being used, the signal arriving first will take precedence. More simply, if the 1-wire interface becomes active before the 3-wire interface, all communications will take place on the 1-wire bus. The 3-wire bus will be ignored in this case. The same condition occurs for the 1-wire interface if the 3-wire interface becomes active first.

Thus, some significant features of the presently preferred embodiment--not all of which are claimed to be separately novel--include the following: Four addressable read/write data partitions; Three secure read/write data partitions of 384 bits each; One non-secure read/write data partition of 512 bits; Secure data cannot be deciphered by reverse engineering; Supports a hierarchical privilege system; Partitioned memory thwarts pirating; 64-bit password and I.D. fields provide a barrier against accidental key erasure; Maximum data transfer rate of 2 million bits/second; Low-power CMOS circuitry; 3-wire bus-compatible; 1-wire "touch" bus-compatible; Applications include software authorization, proprietary data, financial transactions, secure personnel areas, and systems access control.

Preferred Package

The preferred packaging embodiment is an 8-pin SOIC package, as shown in FIG. 21. However, of course, a wide variety of other package types can be used instead if desired.

Chip Layout

FIG. 20 shows the overall layout of the chip of the presently preferred embodiment.

At the center of the chip is a low-power memory array 2030. In the presently preferred embodiment, this is an array of 32 rows by 64 columns of conventional 6-transistor full-CMOS SRAM cells.

The column decoder logic 2034 is conventional (for a serially accessed RAM). However, the row decoder logic 2032 includes memory I/O circuits, and specifically a lookup RAM, which provides remapping of memory blocks as described more fully below.

Power control circuitry 2010 is shown more fully in FIG. 24, and is discussed below.

One-wire interface circuitry 2020 provides translation from the one-wire interface protocol to a standard 3-wire interface, and is shown more fully in FIGS. 25A and 25B.

The move-block decoder and random number generator circuitry 2040 are shown more fully in FIGS. 25A and 25B, and are discussed in detail below.

The control logic 2050 contains a shift register, and decode logic, for decoding a functional command word (such as "Get Secure Data" or "Set Secure Data"). Thus, control logic 2050 and timing circuits 2052 are essentially the same as are commonly used in any chip accessed by a serial port.

If the functional command word is "Move Block," then a further specifier must be transmitted to specify which block is to be moved. This further specifier is decoded by a different shift register, in the move block decoder 2040, described below in detail. This same shift register in the move block decoder 2040 is also used for repeatable pseudo-random number generation, as will be described below.

Specific Circuitry

Some significant features of circuitry in the chip of the presently preferred embodiment will now be described in further detail.

Pseudo-Random Number Generation

FIGS. 22A through 22D show the circuitry which provides pseudo-random number generation.

A chain of D-flops 2210 provides a basic shift register structure. However, note that the connection is occasionally broken by an XOR gate 2220, which combines the propagating logic state with an input from the feedforward line B or the feedback line A. These flip-flops have slightly larger output drivers than normal, in order to drive the decoding logic.

Line B is a feedforward line, which carries forward a state from an early stage for combination into various other nodes along the chain. Line A is a feedback line, which carries back a state from a later stage for combination into various other nodes along the chain.

However, note that the feedforward and feedback lines are only enabled when signal EN₋₋ RND₋₋ DATA ("enable random data") is active.

When the EN₋₋ RND₋₋ DATA signal is not active, the combination of gates 2230 provides a simple combinatorial decoder. This combinatorial logic provides decoding of the block specifier which is used in a block move operation. The 9 possible block destinations are indicated by BLOCK₋₋ 0, BLOCK₋₋ 1, etc., and XFER₋₋ ALL (which indicates that the entire scratchpad is to be copied to the target subkey).

Thus, the structure shown has a double purpose: when a comparator (not shown) detects a password mismatch, the line EN₋₋ RND₋₋ DATA is activated to send out garbage. If line EN₋₋ RND₋₋ DATA is not activated, this shift register structure can operate as a decoder to determine block address.

Note that, if the decoding structure shown detects a mismatch between the specified value and the target subkey's password, signal MBINVB goes active.

When scrambled data is clocked out of the structure shown, it appears on line RND₋₋ DAT₋₋ OUT. A multiplexer (not shown) selects this data stream for output if needed.

The structure shown differs from the actual manufactured embodiment of the DS1205 chip in two respects. First, in the structure shown the XOR gates 2220 have been reconfigured. The structure shown will work perfectly well, and disclosure of the actual manufactured structure would jeopardize the security of that structure.

Secondly, in the structure shown, an input signal SCRMBL enables operation of the random number generator whenever a Get Secure Data operation is requested. Thus, if scrambling is required, the shift registers already contain scrambled data when data output is requested. By contrast, in the actual manufactured embodiment, the EN₋₋ RND₋₋ DATA signal is not enabled until after all 64 bits have been read in, and the preceding comparator indicates whether a mismatch is present. Either version will work perfectly well, but the version pictured is believed to be slightly preferable.

Block Assignment Pointer Management

FIGS. 23A through 23C show details of the translation register and associated logic.

FIG. 23A generally shows a key portion of the translation register. The logic shown is replicated 8 times (once for each segment of the key). For example, the register set for block 3 contains the row address for subkeys 0, 1, and 2, and the scratch pad.

When a move block command is specified, these registers will simply swap addresses between the scratchpad registers and the registers associated with the selected key.

FIG. 23B shows output multiplexing logic associated with the circuitry of FIG. 23A. This circuitry multiplexes the address for the selected subkey onto predecoded row lines MSB and LSB.

FIG. 23C is the illegal state detect circuit. This is an array of pairs of PMOS devices, wired to detect any redundant state in the registers of FIG. 23A. If any such state is detected, signal LKUP₁₃ RST is driven active (high), to force the registers of FIG. 23A to a predetermined default state.

Memory Array

The memory array itself, in the presently preferred embodiment, is an entirely conventional structure of 6-transistor full-CMOS SRAM cells.

Power Source Selection

FIG. 24 shows the circuitry used, in the presently preferred embodiment, for power source selection.

Input VCCI is filtered by resistor 2401A and capacitor 2402A. Input BAT is filtered by resistor 2401B and capacitor 2402B. Comparator 2410 compares the filtered versions of the two inputs BAT and VCCI. When powered up, this comparator will provide a high output if VCCI exceeds BAT.

If the comparator 2410 provides a high output, inverter 2412 will drive a low level onto the gate of large PMOS switching transistor 2420A, which connects VCCI directly to VDD.

However, note that this comparator is powered from input VCCI, not from the on-chip power supply VDD. Thus, if VCCI is below the minimum threshold voltage for a "high" logic level, the output of the comparator will necessarily be low (even if the BAT input is even lower than VCCI), and thus VCCI will not be connected to VDD under these circumstances.

If the BAT input is higher than VCCI (and is also at least a logic "high" level), then the output of comparator 2410 will be low, and the output of inverter 2412 will be high. This will turn on the large PMOS switching transistor 2420B, IF the other input to NAND gate 2434 is also high.

However, note that BAT is also connected directly to the input of inverter 2430. If BAT is not high enough to drive the output of 2430 low, then the output of inverter 2432 will be low, and the output of NAND gate 2434 will necessarily be high. Thus, if BAT is low, the large PMOS switch transistor 2420B will always be turned off, and BAT will never be connected directly to VDD.

Thus, if both BAT and VCCI are low, neither of these pins will be connected to the on-chip power line VDD. Of course, if no pins of the chip were powered, the chip would reach a uniform potential, and would be inactive. However, if the third pin (VCCO, in the presently preferred embodiment) is connected to a battery, the chip can still be powered up. (In this case the chip will operate permanently in the battery operated mode.)

One-Wire Interface

FIGS. 25A and 25B are two parts of a single Figure which shows the one-wire-to-three-wire conversion circuit used, in the presently preferred embodiment, in the integrated circuit of FIG. 20. This circuitry is a fairly straightforward implementation of the logical relationships described, and is pictured here merely for completeness.

Further Modifications and Variations

It will be recognized by those skilled in the art that the innovative concepts disclosed in the present application can be applied in a wide variety of contexts. Moreover, the preferred implementation can be modified in a tremendous variety of ways. Accordingly, it should be understood that the modifications and variations suggested below and above are merely illustrative. These examples may help to show some of the scope of the inventive concepts, but these examples do not nearly exhaust the full scope of variations in the disclosed novel concepts.

As will be recognized by those skilled in the art, the innovative concepts described in the present application can be modified and varied over a tremendous range of applications, and accordingly their scope is not limited except by the allowed claims. 

What is claimed is:
 1. An electronic key device, comprising:a memory; a pseudo-random number generator, connected to receive a seed value and to output a number which is strictly dependent on said seed value, but which is a nonlinear and non-monotone function of said seed value; external connections for receiving a password, and external connections for outputting data; a digital comparator, connected to compare a received password with a stored value, and (1) to enable output of data from said memory when said password does match said stored value and (2) to enable output of data from said pseudo-random number generator when said password does not match said stored value; said pseudo-random number generator being connected to receive said password and to use said password as said seed value such that a unique set of data is output from said pseudo-random number generator for each non-identical password.
 2. The device of claim 1, wherein said password is at least 64 bits in length.
 3. The device of claim 1, wherein said pseudo-random number generator is an infinite impulse response (IIR) filter having both feed-forward and feedback connections.
 4. The devices of claim 1, wherein said pseudo-random number generator comprises:a chain of plural multiple-input logic gates, each having a clock input, and at least one data input, and at least one data output; a feedforward bus and a feedback bus; wherein substantially each said gate is connected in either a first configuration or a second configuration, and (1) ones of said gates which are connected in said first configuration have said data input thereof connected directly to said output of the preceding one of said gates in said chain, (2) ones of said gates which are connected in said second configuration have said data input thereof connected directly to the output of a respective XOR gate which has one input thereof connected directly to said output of the preceding one of said gates in said chain, said XOR gate also having another input thereof which is connected either to said feedforward bus or to said feedback bus. 